On the Convergence of Feasibility based Bounds Tightening
نویسندگان
چکیده
Global Optimization and Mixed-Integer Nonlinear Programming problems such as min{f(x) | g ≤ g(x) ≤ g ∧ x ≤ x ≤ x ∧ ∀j ∈ Z (xj ∈ Z)}, where f : R → R, g : R → R, g, g ∈ R, x, x, x ∈ R and Z ⊆ {1, . . . , n}, ⋆ Financial support by grants System@tic “EDONA”, ANR 07-JCJC-0151 “Ars”, ANR 08-SEGI-023 “Asopt”, Digiteo Emergence “Paso” is gratefully acknowledged. ∗ Corresponding author. Email addresses: [email protected] (Pietro Belotti), [email protected] (Sonia Cafieri), [email protected] (Jon Lee), [email protected] (Leo Liberti).
منابع مشابه
Feasibility-Based Bounds Tightening via Fixed Points
The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ranges at every tree node. A range reduction technique often employed is called Feasibility Based Bounds Tightening, which is known to be practically fast, and is thus deployed at every node of the search tree. From time to tim...
متن کاملOn feasibility based bounds tightening0
Mathematical programming problems involving nonconvexities are usually solved to optimality using a (spatial) Branch-and-Bound algorithm. Algorithmic efficiency depends on many factors, among which the widths of the bounding box for the problem variables at each Branch-and-Bound node naturally plays a critical role. The practically fastest box-tightening algorithm is known as FBBT (Feasibility-...
متن کاملA Scalable Global Optimization Algorithm for Stochastic Nonlinear Programs
We propose a global optimization algorithm for stochastic nonlinear programs that uses a specialized spatial branch and bound (BB) strategy to exploit the nearly decomposable structure of the problem. In particular, at each node in the BB scheme, a lower bound is constructed by relaxing the so-called non-anticipativity constraints and an upper bound is constructed by fixing the first-stage vari...
متن کاملConvergence rate analysis and error bounds for projection algorithms in convex feasibility problems
Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems Amir Beck & Marc Teboulle To cite this article: Amir Beck & Marc Teboulle (2003) Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems, Optimization Methods and Software, 18:4, 377-394, DOI: 10.1080/10556780310001604977 To link to this article: http:/...
متن کاملConvergent Decomposition Solvers for Tree-reweighted Free Energies
We investigate minimization of treereweighted free energies for the purpose of obtaining approximate marginal probabilities and upper bounds on the partition function of cyclic graphical models. The solvers we present for this problem work by directly tightening tree-reweighted upper bounds. As a result, they are particularly efficient for tree-reweighted energies arising from a small number of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010